#include<iostream>
#include<cmath>
using namespace std;
int n;
bool isprime(int n)
{
	int m = ceil(sqrt(n));
	for (int i = 2; i <= m; i++)if (n%i == 0)return false;
	return true;
}
int exam1_6()
{
	cin >> n;
	bool empty = 1;
	for (int i = 2; i <= n - 2; i++)
	{
	if (isprime(i) && isprime(i + 2))
	{
		empty = 0;
		cout << i << ' ' << i + 2 << endl;
	}
	}
	if (empty)cout << "empty";
	return 0;
}